#define _CRT_SECURE_NO_WARNINGS
#include"Tree.h"
#include"Queue.h"
int main()
{
	
	char arr[] = "ABD##E#H##CF##G##";
	int z = 0;
	int s = 1;
	BTNode* Tree = BinaryTreeCreate(arr, strlen(arr), &z);
	printf("%d ", BinaryTreeSize(Tree));
	printf("%d ", BinaryTreeLeafSize(Tree));
	int ret = BinaryTreeLevelKSize(Tree, 3, s);
	printf("%d ", ret);
	printf("%p", BinaryTreeFind(Tree, 'C'));
	printf("\n");
	BinaryTreePrevOrder(Tree);
	printf("\n");
	BinaryTreeInOrder(Tree);
	printf("\n");
	BinaryTreePostOrder(Tree);
	printf("\n");
	BinaryTreeLevelOrder(Tree);
	BinaryTreeDestory(&Tree);

	return 0;
}